goal programming approach to the bi-objective competitive flow-capturing location-allocation problem

Authors

ehsan nikbakhsh is a ph.d. candidate in the departement of industrial engineering, faculty of engineering, tarbiat modares university

nasim nahavandi is an assistant professor in the departement of industrial engineering, faculty of engineering, tarbiat modares university,

seyed hessameddin zegordi is an associate professor in the departement of industrial engineering, faculty of engineering, tarbiat modares university

abstract

majority of models in location literature are based on assumptions such as point demand, absence of competitors, as well as monopoly in location, products, and services. however in real-world applications, these assumptions are not well-matched with reality. in this study, a new mixed integer nonlinear programming model based on weighted goal programming approach is proposed to maximize the captured demand while minimizing the fixed costs of locating new facilities. to make the proposed model optimization simple, the proposed model is linearized using proper modeling techniques. although goal programming method does not ensure obtaining pareto-optimal solutions, solving a numerical example demonstrates the possibility of obtaining pareto-optimal solutions for the research problem besides higher speed of the classical branch & bound method in obtaining the optimal solution in comparison to the conventional single objective model .

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Goal Programming Approach to the Bi-Objective Competitive Flow-Capturing Location-Allocation Problem

  Majority of models in location literature are based on assumptions such as point demand, absence of competitors, as well as monopoly in location, products, and services. However in real-world applications, these assumptions are not well-matched with reality. In this study, a new mixed integer nonlinear programming model based on weighted goal programming approach is proposed to maximize the c...

full text

A Tabu Search Based Solution Approach to the Competitive Multiple Allocation Hub Location Problem

The hub location problems (HLP) constitute an important class of facility location problems that have been addressed by numerous operations researchers in recent years. HLP is a strategic problem frequently encountered in designing logistics and transportation networks. Here, we address the competitive multiple allocation HLP in a duopoly market. It is assumed that an incumbent firm (the leader...

full text

Developing a New Bi-Objective Functions Model for a Hierarchical Location-Allocation Problem Using the Queuing Theory and Mathematical Programming

In this research, a hierarchical location-allocation problem is modeled in a queue framework. The queue model is considered as M/M/1/k, in which system capacity is finite, equals to k. This is the main contribution of the current research. Customer's enters to the system in order to find the service according to a Poisson. In this problem, the hierarchical location-allocation model is considere...

full text

Fuzzy Goal Programming Approach to Quadratic Bi-Level Multi-Objective Programming Problem

This paper deals with fuzzy goal programming approach to quadratic bi-level multi-objective programming problem involving a single decision maker with multiple objectives at the upper level and a single decision maker with multiple objectives at the lower level. The objective functions of each level decision maker are quadratic in nature and the system constraints are linear functions. In the m...

full text

TOPSIS approach to linear fractional bi-level MODM problem based on fuzzy goal programming

The objective of this paper is to present a technique for order preference by similarity to ideal solution (TOPSIS) algorithm to linear fractional bi-level multi-objective decision-making problem. TOPSIS is used to yield most appropriate alternative from a finite set of alternatives based upon simultaneous shortest distance from positive ideal solution (PIS) and furthest distance from negative ...

full text

Quadratic bi-level programming problems: a fuzzy goal programming approach

This paper presents a fuzzy goal programming (FGP) methodology for solving bi-level quadratic programming (BLQP) problems. In the FGP model formulation, firstly the objectives are transformed into fuzzy goals (membership functions) by means of assigning an aspiration level to each of them, and suitable membership function is defined for each objectives, and also the membership functions for vec...

full text

My Resources

Save resource for easier access later


Journal title:
بین المللی مهندسی صنایع و مدیریت تولید

جلد ۲۲، شماره ۳، صفحات ۲۹۳-۳۰۲

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023